Almost All k-Colorable Graphs are Easy to Color
نویسنده
چکیده
We describe a simple and eecient heuristic algorithm for the graph coloring problem and show that for all k 1, it nds an optimal coloring for almost all k-colorable graphs. We also show that an algorithm proposed by Br elaz and justiied on experimental grounds optimally colors almost all k-colorable graphs. EEcient implementations of both algorithms are given. The rst one runs in O(n+m log k) time where n is the number of vertices and m the number of edges. The new implementation of Br elaz's algorithm runs in O(m log n) time. We observe that the popular greedy heuristic works poorly on k-colorable graphs.
منابع مشابه
Coloring Random and Semi-Random k-Colorable Graphs
The problem of coloring a graph with the minimum number of colors is well known to be NPhard, even restricted to k-colorable graphs for constant k 3. On the other hand, it is known that random k-colorable graphs are easy to k-color. The algorithms for coloring random kcolorable graphs require fairly high edge densities, however. In this paper we present algorithms that color randomly generated ...
متن کاملExcluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with chromatic number k + 1 almost all graphs not containing H as a subgraph are k-colorable if and only if H contains a color-critical edge. We strengthen the concept of H-free to induced subgraph containment, proving that...
متن کاملVertex colorings with a distance restriction
Let d, k be any two positive integers with k > d > 0. We consider a k-coloring of a graph G such that the distance between each pair of vertices in the same color-class is at least d. Such graphs are said to be (k,d)-colorable. The object of this paper is to determine the maximum size of (k, 3)-colorable, (k, 4)-colorable, and (k, k 1 )-colorable graphs. Sharp results are obtained for both (k, ...
متن کاملList colourings of planar graphs
Let G = (V,E) be a graph, let f : V (G)→ N, and let k ≥ 0 be an integer. A list-assignment L of G is a function that assigns to each vertex v of G a set (list) L(v) of colors: usually each color is a positive integer. We say that L is an f -assignment if |L(v)| = f(v) for all v ∈ V , and a k-assignment if |L(v)| = k for all v ∈ V . A coloring ofG is a function φ that assigns a color to each ver...
متن کاملFinding Large Independent Sets
This lecture deals with the problem of proper vertex colorings of graphs. More speciically, we are interested in coloring a given 3-colorable graph with as few colors as we can. It is easy to see that it is NP-Hard to nd a 3 coloring for any given 3-colorable graph-this would enable deciding whether a general graph is 3-colorable. If a polynomial-time algorithm existed for 3-coloring a 3-colora...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 9 شماره
صفحات -
تاریخ انتشار 1988